Ensuring Message Embedding in Wet Paper Steganography

نویسندگان

  • Daniel Augot
  • Morgan Barbier
  • Caroline Fontaine
چکیده

Syndrome coding has been proposed by Crandall in 1998 as a method to stealthily embed a message in a cover-medium through the use of bounded decoding. In 2005, Fridrich et al. introduced wet paper codes to improve the undetectability of the embedding by enabling the sender to lock some components of the cover-data, according to the nature of the cover-medium and the message. Unfortunately, almost all existing methods solving the bounded decoding syndrome problem with or without locked components have a non-zero probability to fail. In this paper, we introduce a randomized syndrome coding, which guarantees the embedding success with probability one. We analyze the parameters of this new scheme in the case of perfect codes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Wet Paper Codes

Wet paper codes were proposed as a tool for constructing steganographic schemes with an arbitrary selection channel that is not shared between the sender and the recipient. In this paper, we describe new approaches to wet paper codes that enjoy low computational complexity and improved embedding efficiency (number of message bits per embedding change). Some applications of wet paper codes to st...

متن کامل

Wet paper codes and the dual distance in steganography

In 1998 Crandall introduced a method based on coding theory to secretly embed a message in a digital support such as an image. Later Fridrich et al. improved this method to minimize the distortion introduced by the embedding; a process called wet paper. However, as previously emphasized in the literature, this method can fail during the embedding step. Here we find sufficient and necessary cond...

متن کامل

A Double Layered "Plus-Minus One" Data Embedding Scheme

In image steganography, a pixel can carry secret bits by choosing adding/subtracting one to/from the gray value. This kind of “ 1 steganography” can hide a longer message than simple LSB embedding. We propose a double-layered embedding method for implementing “ 1 steganography,” in which binary covering codes and wet paper codes are used to hide messages in the LSB plane and the second LSB plan...

متن کامل

A Novel method of Reducing Additive Distortion in Steganography with Embedding Operation

–This paper proposes a new methodology for reducing additive distortion in steganography with embedding operation. In this paper it is planned to introduce a method that embed 2 bits information in a pixel and alter one bit from one bit plane but the message does not necessarily place in the least significant bit of pixel and second less significant bit plane and fourth less significant bit pla...

متن کامل

Steganography for Colored Images

In this paper, we present a novel method to embedding secret message in the cover-image. The basic concept of the proposed method is by simple Least Significant Bit (LSB) substitution. We propose a steganography method that applies a technique to embedding a wavelet compressed secret message within the Least Significant Bit (LSB) of the cover image pixels in a specific pattern. The proposed met...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011